Semantic Matchmaking of Web Resources with Local Closed-World Reasoning
نویسندگان
چکیده
منابع مشابه
Semantic Matchmaking of Web Resources with Local Closed-World Reasoning
Ontology languages like OWL allow for semantically rich annotation of resources, such as products advertised at an electronic online marketplace, while the Description Logic (DL) formalism underlying OWL provides reasoning techniques to perform matchmaking on such annotations. We identify peculiarities in the use of DL inferences for matchmaking which are due to the open-world semantics of OWL,...
متن کاملLocal Closed-World Assumptions for reasoning about Semantic Web data
The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-accessible ontologies. Several interesting languages are now available for the Semantic Web. They exploit XML allowing data/metadata communication, yet are endowed with a logical semantics. Such languages allow compact descriptio...
متن کاملTowards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and closed world reasoning for the Semantic Web. We present an extension based on a new three-valued framework including an alternating fixpoint, the well-founded MKNF model. This approach, the well-founded MKNF semantics, de...
متن کاملMatching Semantic Service Descriptions with Local Closed-World Reasoning
Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the services explicitly, using semantic annotations. Such annotations can, for example, be used for service discovery—the task of locating a service capable of fulfilling a business request. In this paper, we present a framework for ...
متن کاملOpen and Closed World Reasoning in the Semantic Web
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or “negation as failure”). The proposed mechanisms are defined by very simple modular program transformations, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronic Commerce
سال: 2007
ISSN: 1086-4415,1557-9301
DOI: 10.2753/jec1086-4415120204